23 research outputs found
NodeTrix Planarity Testing with Small Clusters
We study the NodeTrix planarity testing problem for flat clustered graphs
when the maximum size of each cluster is bounded by a constant . We consider
both the case when the sides of the matrices to which the edges are incident
are fixed and the case when they can be chosen arbitrarily. We show that
NodeTrix planarity testing with fixed sides can be solved in
time for every flat clustered graph that can be
reduced to a partial 2-tree by collapsing its clusters into single vertices. In
the general case, NodeTrix planarity testing with fixed sides can be solved in
time for , but it is NP-complete for any . NodeTrix
planarity testing remains NP-complete also in the free sides model when .Comment: Appears in the Proceedings of the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017
Evaluating Animation Parameters for Morphing Edge Drawings
Partial edge drawings (PED) of graphs avoid edge crossings by subdividing
each edge into three parts and representing only its stubs, i.e., the parts
incident to the end-nodes. The morphing edge drawing model (MED) extends the
PED drawing style by animations that smoothly morph each edge between its
representation as stubs and the one as a fully drawn segment while avoiding new
crossings. Participants of a previous study on MED (Misue and Akasaka, GD19)
reported eye straining caused by the animation. We conducted a user study to
evaluate how this effect is influenced by varying animation speed and animation
dynamic by considering an easing technique that is commonly used in web design.
Our results provide indications that the easing technique may help users in
executing topology-based tasks accurately. The participants also expressed
appreciation for the easing and a preference for a slow animation speed.Comment: Appears in the Proceedings of the 31st International Symposium on
Graph Drawing and Network Visualization (GD 2023